首页> 外文OA文献 >Delay QoS and MAC Aware Energy-Efficient Data-Aggregation Routing in Wireless Sensor Networks
【2h】

Delay QoS and MAC Aware Energy-Efficient Data-Aggregation Routing in Wireless Sensor Networks

机译:无线传感器网络中的延迟QoS和MAC感知节能数据聚合路由

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

By eliminating redundant data flows, data aggregation capabilities in wireless sensor networks could transmit less data to reduce the total energy consumption. However, additional data collisions incur extra data retransmissions. These data retransmissions not only increase the system energy consumption, but also increase link transmission delays. The decision of when and where to aggregate data depends on the trade-off between data aggregation and data retransmission. The challenges of this problem need to address the routing (layer 3) and the MAC layer retransmissions (layer 2) at the same time to identify energy-efficient data-aggregation routing assignments, and in the meantime to meet the delay QoS. In this paper, for the first time, we study this cross-layer design problem by using optimization-based heuristics. We first model this problem as a non-convex mathematical programming problem where the objective is to minimize the total energy consumption subject to the data aggregation tree and the delay QoS constraints. The objective function includes the energy in the transmission mode (data transmissions and data retransmissions) and the energy in the idle mode (to wait for data from downstream nodes in the data aggregation tree). The proposed solution approach is based on Lagrangean relaxation in conjunction with a number of optimization-based heuristics. From the computational experiments, it is shown that the proposed algorithm outperforms existing heuristics that do not take MAC layer retransmissions and the energy consumption in the idle mode into account.
机译:通过消除冗余数据流,无线传感器网络中的数据聚合功能可以传输更少的数据以减少总能耗。但是,额外的数据冲突会导致额外的数据重传。这些数据重传不仅增加了系统能耗,还增加了链路传输延迟。何时何地聚合数据的决定取决于数据聚合和数据重传之间的权衡。这个问题的挑战需要同时解决路由选择(第3层)和MAC层重传(第2层)的问题,以识别高能效的数据聚合路由分配,同时满足延迟QoS。在本文中,我们首次使用基于优化的启发式方法研究了此跨层设计问题。我们首先将此问题建模为非凸数学规划问题,其目标是在数据聚合树和延迟QoS约束下,将总能耗降至最低。目标函数包括传输模式下的能量(数据传输和数据重传)和空闲模式下的能量(等待数据聚合树中来自下游节点的数据)。所提出的解决方案方法基于Lagrangean松弛以及许多基于优化的启发式算法。从计算实验中可以看出,该算法优于不考虑MAC层重传和空闲模式能耗的现有启发式算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号